TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 4

  • Online Practice Test - CSE
   

1.

  How many temporary variables can be generated by the following expression to preserve the intermediate results using three address code?
a = (b + c) * (a + b + c).
  • A.   3
  •  
  • B.   2
  •  
  • C.   5
  •  
  • D.   4
  Options: A    B    C    D   
   
 
   

2.

  The interdependencies among the inherited and synthesized attributes at the nodes in a parse tree can be depicted by a direct graph called :.
  • A.   Cyclic graph
  •  
  • B.   Acyclic graph
  •  
  • C.   Independency graph
  •  
  • D.   Dependency graph
  Options: A    B    C    D   
   
   

3.

  At a particular time, the value of a counting semaphore is 10. It will become 7 after :.
  • A.   3 signal operations
  •  
  • B.   3 wait operations
  •  
  • C.   5 signal and 2 wait operations
  •  
  • D.   13 wait and 10 signal operations
  Options: A    B    C    D   
   
 
   

4.

  Which of the following is true?.
  • A.   Accepting states of the NFA are those sets that include at least one accepting state of the DFA
  •  
  • B.   Accepting states of the DFA are those sets that include at least one accepting state of the NFA
  •  
  • C.   Accepting states of both NFA and DFA sets are equivalent, but sometimes may vary
  •  
  • D.   Accepting states of both NFA and DFA sets are equivalent always
  Options: A    B    C    D   
   
   

5.

  A binary tree is implemented as a self referential structure using :.
  • A.   Queue
  •  
  • B.   Linked list
  •  
  • C.   Array
  •  
  • D.   Stack
  Options: A    B    C    D   
   
 
   

6.

  Array representation of priority queue is :.
  • A.   Time efficiency is more
  •  
  • B.   Space efficiency is more
  •  
  • C.   Time efficiency is less
  •  
  • D.   Space efficiency is less
  Options: A    B    C    D   
   
   

7.

  Following sequence of operations is performed on a stack :
Push(1), push(2) , pop , push(1) , push(2) pop ,pop ,pop ,push(2) , pop.
The sequence of popped output values are: .
  • A.   2, 2, 1, 1, 2
  •  
  • B.   2, 2, 1, 2, 2
  •  
  • C.   2, 1, 2, 2, 1
  •  
  • D.   2, 1, 2, 2, 2
  Options: A    B    C    D   
   
 
   

8.

  The process that is used to convert identifiers (variables and function names) into machine language address is called :.
  • A.   Linking
  •  
  • B.   Compiling
  •  
  • C.   Binding
  •  
  • D.   Assembling
  Options: A    B    C    D   
   
   

9.

  The strategy of allowing processes that are logically runnable to be temporarily suspended is called :.
  • A.   preemptive scheduling
  •  
  • B.   Non- preemptive scheduling
  •  
  • C.   Shortest job first
  •  
  • D.   First come first served
  Options: A    B    C    D   
   
 
   

10.

  The most common techniques used for protecting a critical section in LINUX is: .
  • A.   Semwait
  •  
  • B.   Mutual exclusion locks
  •  
  • C.   Spin locks
  •  
  • D.   Dead locks
  Options: A    B    C    D   
   

Complete Test